A survey of exact motif finding algorithms

نویسندگان

چکیده

<span lang="EN-US"><span lang="EN-US">Deoxyribonucleic </span>acid (DNA) motif finding (discovery/mining) in biological chains is the most recent challenging and interesting trend bioinformatics. It represents a crucial phase bioinformatics systems related to unravelling secrets of gene functions. Despite efforts made date produce robust algorithms, DNA remains difficult task for researchers this field. In general, pattern locating algorithms are categorized into two categories: probabilistic numerical methods. paper, we provide survey exact their working principles with suitable comparison among these an essential step field.</span>

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exact algorithms for motif search

In this paper we study the problem of identifying meaningful patterns (i.e., motifs) from biological data. The general version of this problem is NP-hard. Numerous algorithms have been proposed in the literature to solve this problem. Many of these algorithms fall under the category of approximation algorithms. We concentrate on exact algorithms in this paper. In particular, we concentrate on t...

متن کامل

Exact algorithms for planted motif challenge problems

The problem of identifying meaningful patterns (i.e., motifs) from biological data has been studied extensively due to its paramount importance. Three versions of this problem have been identified in the literature. One of these three problems is the planted (l, d)-motif problem. Several instances of this problem have been posed as a challenge. Numerous algorithms have been proposed in the lite...

متن کامل

Voting algorithms for the motif finding problem.

UNLABELLED Finding motifs in many sequences is an important problem in computational biology, especially in identification of regulatory motifs in DNA sequences. Let c be a motif sequence. Given a set of sequences, each is planted with a mutated version of c at an unknown position, the motif finding problem is to find these planted motifs and the original c. In this paper, we study the VM model...

متن کامل

a structural survey of the polish posters

تصویرسازی قابلیتهای فراوانی را دارا است

15 صفحه اول

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Indonesian Journal of Electrical Engineering and Computer Science

سال: 2022

ISSN: ['2502-4752', '2502-4760']

DOI: https://doi.org/10.11591/ijeecs.v27.i2.pp1109-1118